A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs
نویسندگان
چکیده
Many combinatorial problems can be efficiently solved for series]parallel multigraphs. However, the edge-coloring problem of finding the minimum number of colors required for edge-coloring given graphs is one of a few well-known combinatorial problems for which no efficient algorithms have been obtained for series]parallel multigraphs. This paper gives a linear algorithm for the problem on series]parallel multigraphs. Q 1996 Academic Press, Inc.
منابع مشابه
Edge-coloring series-parallel multigraphs
We give a simpler proof of Seymour’s Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.
متن کاملAn NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs
Many combinatorial problems can be efficiently solved in parallel for series]parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series]parallel multigraphs. This paper gives an NC parallel algorithm for the Ž . Ž . problem on series]parallel multigraphs G. It takes O log n time with O Dnrlog n processor...
متن کاملAn Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs
Many combinatorial problems can be efficiently solved for series-parallel graphs or partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no efficient algorithms have been obtained for series-parallel multigraphs. This paper gives an algorithm which optimally edge-colors a given series-parallel multigraph in time O([V[z~), where V is the set of vertices and...
متن کاملParallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
with D 1 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires D or D 1 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that x9(G) # 3D/2 [16]. A number of parallel algorithms exist for the edge-coloring problem. Lev et al. [14] presented parallel edge-coloring algorithms with D colors for bipartite multigraphs. When D 5 2, the...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 20 شماره
صفحات -
تاریخ انتشار 1996